Weighted well-covered claw-free graphs
نویسندگان
چکیده
منابع مشابه
Weighted well-covered claw-free graphs
A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For every graph G, the set of weight functions w such that G is w-well-covered is a vector space. Given an input claw-free graph G, we present an O (
متن کاملWell-Covered Claw-Free Graphs
We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic to K1.3 , is well covered. A graph is wellcovered if all its maximal independent sets are of the same cardinality. The problem is known to be polynomialy solvable where the input graph is a line graph and it is NP-hard for the larger family of all graphs which do not contain an ind...
متن کاملWeighted Well-covered Graphs and Complexity Questions Weighted Well-covered Graphs and Complexity Questions
A weighted graph G is called well-covered if all its maximal stable sets have the same weight. G. Let S be a stable set of G (possibly, S = ;). The subgraph G?NS] is called a co-stable subgraph of G. We denote by CSub(G) the set of all co-stable subgraphs of G (considered up to isomorphism). A class of weighted graphs P is called co-hereditary if it is closed under taking co-stable subgraphs, i...
متن کاملWeighted Well-covered Graphs and Complexity Questions
A weighted graph G is called well-covered if all its maximal independent sets have the same weight. Let S be an independent set of G (possibly, S = ∅). The subgraph G − N [S] is called a co-stable subgraph of G. We denote by CSub(G) the set of all co-stable subgraphs of G considered up to isomorphism. A class of weighted graphs P is called co-hereditary if it is closed under taking co-stable su...
متن کاملClaw-free Graphs VI. Colouring Claw-free Graphs
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.10.008